Divided differences, shift transformations and Larkin’s root finding method
نویسندگان
چکیده
منابع مشابه
Divided Differences , Shift Transformations and Larkin ' s Root Finding Method
For a one-dimensional complex-valued function/this paper deals with iterative root finding methods using divided differences of /. Assuming that / is given in a Newtonian representation we show how Homer-like transformations ("shift transformations") yield the divided differences needed in each iteration step. In particular, we consider an iteration method given by Larkin [5] and derive an equi...
متن کاملDivided Differences
Starting with a novel definition of divided differences, this essay derives and discusses the basic properties of, and facts about, (univariate) divided differences. “It belongs to the most beautiful I have been able to do.”[Newton 1676]
متن کاملQuasipolynomial root-finding: A numerical homotopy method∗
Quasipolynomials arise in a number of applications, and in particular as the characteristic equation associated with systems of delay differential equations. Quasipolynomial equations are generally difficult to solve, and most often must be solved numerically. In the non-trivial case, quasipolynomials have an infinite number of roots in the complex plane. We present a new numerical method for f...
متن کاملInterpolating polynomials and divided differences
We shall take it as known that a polynomial of degree n has at most n distinct zeros (a proof is given in Lemma 1 below). Given n+1 distinct real numbers xj and any numbers αj (0 ≤ j ≤ n), there is a unique polynomial p of degree at most n satisfying p(xj) = αj (0 ≤ j ≤ n). The polynomial is unique, since if p1 and p2 were two such polynomials, then p1−p2 would be zero at each xj: since it has ...
متن کاملOn Modified Divided Differences II
From (7) and (9) it is clear that the only essential information contained in Ei is the set of values i\u and the index rt. Note further that in (8), the successive Ei are used with increasing I and it follows from (9) that it is necessary to know ri before using the r¡n. On the other hand, in (6), the E¡ are used in decreasing sequence of / but from (7) it is not necessary to know rt until aft...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1985
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1985-0790651-7